package QuickAndMergeSort;

public class QuickAndMergeSort {
    public static void main(String[] args){
        int[] arr=new int[800];
        for(int i=0;i<800;i++){
            arr[i]=(int)(Math.random()*800);
        }
        Setting.quick(0,arr.length-1,arr);
        Setting.print(arr);

       //int[] arr02=new int[801];
       //for(int i=0;i<801;i++){
       //    arr02[i]=(int)(Math.random()*801);
       //}
        int[] arr02={7,3,9,1,4,6,8,2,0};
        int arr03[]=new int[arr02.length];
        Setting.merge(0,8,arr02,arr03);
        Setting.print(arr02);
    }
}
